import java.io.EOFException;

/**
 *  Class: Datastructures, CSI 326 Fall 2011
 *  Members: Christopher Nerf, Greg Shevach, Mesfin Solomon, Vidat Muslim
 *  Project: Project 1
 *  Scope: Implement a stack using one of the basic containers we have or will discuss. Example: A vector or list based stack.
 *  	   Implement a queue using one of the basic containers we have or will discuss. Example: A circular array or list based
 *		   queue
 *		   Develop and implement a palindrome checker that uses your stack and/or queue.
 *				 The data to be checked as a palindrome will consist of string characters, possibly containing whitespace and
 *				punctuation.
 *				 A palindrome reads the same forward as backward, ignoring case, whitespace and punctuation.
 *				 The strings to check will be stored in a file, one string per line. The file will contain the string quit to signify
 *				the end of file.
 *				 The strings can be of any length
 *  Version: 0.0 - Initial Pass
 */



public class Project {
	public static void main(String []args)
	{
		
		//time to test the palindrome
		
		PalindromeChecker pc = new PalindromeChecker("C:\\Users\\nerfc\\Desktop\\SVN-Data Structures\\Project 1\\DataStructuresProject1\\src\\palindrome.txt");
		
		while(true)
			try {
				System.out.println(pc.weakCompareNext());
			} catch (EOFException e) {
				// TODO Auto-generated catch block
				//e.printStackTrace();
				break;
			}
		catch (Exception wtf)
		{
			//Seriously, I don't get it, Java is telling me QUIT != QUIT, and keeps erroring out.
			break;
		}
		
		
	}
	
	

}
